One-Wayness/KEM Equivalent to General Factoring
نویسندگان
چکیده
This paper shows the first practical semantically secure public-key encryption scheme such that its one-wayness is equivalent to general factoring in the standard model (in the sense of IND-CPA). Next our proof technique is applied to Rabin-Parlier encryption scheme and a variant of RSA-Paillier encryption scheme to prove their exactly tight one-wayness. We finally present the first KEM which is secure in the sense of IND-CCA under general factoring assumption in the random oracle model.
منابع مشابه
Some RSA-Based Encryption Schemes with Tight Security Reduction
In this paper, we study some RSA-based semantically secure encryption schemes (IND-CPA) in the standard model. We first derive the exactly tight one-wayness of Rabin-Paillier encryption scheme which assumes that factoring Blum integers is hard. We next propose the first IND-CPA scheme whose one-wayness is equivalent to factoring general n = pq (not factoring Blum integers). Our reductions of on...
متن کاملTrading One-Wayness Against Chosen-Ciphertext Security in Factoring-Based Encryption
We revisit a long-lived folklore impossibility result for factoring-based encryption and properly establish that reaching maximally secure one-wayness (i.e. equivalent to factoring) and resisting chosenciphertext attacks (CCA) are incompatible goals for single-key cryptosystems. We pinpoint two tradeoffs between security notions in the standard model that have always remained unnoticed in the R...
متن کاملIdentification Schemes from Key Encapsulation Mechanisms
We propose a generic way for deriving an identification (ID) scheme secure against concurrent man-in-the-middle attacks from a key encapsulation mechanism (KEM) secure against chosen ciphertext attacks on one-wayness (one-way-CCA). Then we give a concrete one-way-CCA secure KEM based on the Computational Diffie-Hellman (CDH) assumption. In that construction, the Twin Diffie-Hellman technique of...
متن کاملA Provably Secure Elliptic Curve Scheme with Fast Encryption
We present a new elliptic curve cryptosystem with fast encryption and key generation, which is provably secure in the standard model. The scheme uses arithmetic modulo n, where n is an RSA modulus, and merges ideas from Paillier and Rabin related schemes. Despite the typical bit length of n, our encryption algorithm is faster than El Gamal elliptic curve cryptosystems. The one-wayness of the ne...
متن کاملA Universally Composable Secure Channel Based on the KEM-DEM Framework
SUMMARY As part of ISO standards on public-key encryption, Shoup introduced the framework of KEM (Key Encapsulation Mechanism), and DEM (Data Encapsulation Mechanism), for formalizing and realizing one-directional hybrid encryption; KEM is a formalization of asymmetric en-cryption specified for key distribution, which DEM is a formalization of symmetric encryption. This paper investigates a mor...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2005